Solving Some Discrepancy Problems in NC
نویسندگان
چکیده
منابع مشابه
Discrepancy Search for solving flexible scheduling problems
Flexible scheduling problems under study are Flexible Job Shop (FJS) and Hybrid Flow Shop (HFS), which generalize traditional scheduling problems. For flexible scheduling problems it is desired to process operations on a machine chosen among a set of available ones. The objective is to find a schedule which minimizes the makespan. The FJS problem is more computationally difficult than the Job S...
متن کاملOn the discrepancy principle for some Newton type methods for solving nonlinear inverse problems
We consider the computation of stable approximations to the exact solution x† of nonlinear ill-posed inverse problems F(x) = y with nonlinear operators F : X → Y between two Hilbert spaces X and Y by the Newton type methods xk+1 = x0 −gαk (
متن کاملSolving some persistent presupposition problems
/S0aanes 1979/provides some counterexamples to the theory of natural language presuppositions that is presented in /Gazdar 1979/. /Soames 1982/ provides a theory which explains these eounterexamples. /Mercer 1987/ rejects the solution found in/Soames 1982/ leaving these eounterexamples unexplained. By reappraising these insightful counterexamples, the inferential theory for natural language pre...
متن کاملOn Some Problems in Satisfiability Solving
Satisfiability solving is the problem of determining whether a given formula has a solution. The most ubiquitous and well-studied satisfiability problem is propositional satisfiability (SAT), in which all variables are Boolean. In recent years, the field of satisfiability modulo theories (SMT) has extended methods in SAT solving to accommodate existential first order formulas with non-Boolean v...
متن کاملSome Methods for Solving Quasi-Equilibrium Problems
Let X be a given nonempty closed convex subset in IR and let f : X×X −→ IR be a given bifunction with f(x, x) = 0 for all x ∈ X. We are interested in the following quasi-equilibrium problem { Find x ∈ K(x) such that f(x, y) ≥ 0 ∀ y ∈ K(x) (QEP ) where K(·) is a multivalued mapping X −→ 2 . When the mapping x −→ K(x) is such that K(x) = X for all x ∈ X, (QEP ) reduces naturally to the equilibriu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2001
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s004530010046